Isols and burnside's lemma

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hereditarily Odd–even and Combinatorial Isols

In this paper we study some of the arithmetic structure that is found in a special kind of semi-ring in the isols. These are the semi-rings [D(Y ),+, ·] that were introduced by J.C.E. Dekker, and that were later shown by E. Ellentuck to model the true universal recursive statements of arithmetic when Y is a regressive isol and is hyper-torre (= hereditarily odd-even = HOE). When Y is regressive...

متن کامل

Nonrecursive Relations among the Isols

The universal isol metatheorem is extended so as to deal with nonrecursive relations and countable Boolean operations.

متن کامل

Recursive Fibers of Rst Isols

Motivated by a conjecture of Ellentuck concerning fibers f^x(C), f recursive and C an element of one of Barback's "tame models" (Tame models in the isols, Houston J. Math. 12 (1986), 163-175), we study such fibers in the more general context of Nerode semirings. The principal results are that (1) all existentially complete Nerode semirings meet all of their recursive fibers, and (2) not all Ner...

متن کامل

On the Minimality of Tame Models in the Isols

Based on the work of Hirschfeld, it is known that there is a close connection between models for the n°j fragment of arithmetic and homomorphic images of the semiring of recursive functions. This fragment of arithmetic includes most of the familiar results of classical number theory. There is a realization of this fragment in the isols in systems called tame models. In this paper a new proof is...

متن کامل

Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory

Let D(n)(D(n, k)) denote the maximum possible d such that there exists a d-regular hypergraph (d-regular k-uniform hypergraph, respectively) on n vertices containing no proper regular spanning subhypergraph. The problem of estimating D(n) arises in Game Theory and Huckemann and Jurkat were the first to prove that it is finite. Here we give two new simple proofs that D(n), D(n, k) are finite, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1986

ISSN: 0168-0072

DOI: 10.1016/0168-0072(86)90054-0